F G 1 2 1 2 1
نویسندگان
چکیده
Multiresolution geometric models support the representation and processing of geometric entities at di erent levels of resolution, and are useful in several application elds, such as geographic information systems, CAD systems and scienti c visualization. The aim of this paper is to provide a systematic framework for multiresolution geometric modeling, independent both of the dimension of spatial objects under consideration, and of the speci c application. This paper introduces a formal model, called the Multiresolution Simplicial Model (MSM), capable of capturing the characteristics of most models known in the literature. The paper provides an analysis of the relationships between the intrinsic structures of di erent multiresolution models, and a de nition of the relevant operations on them. Finally, major data structures used to encode multiresolution models are reviewed, as well as algorithms which implement the operations on each data structure. Leila De Floriani , Enrico Puppo , and Paola Magillo
منابع مشابه
Analytic Functions Involving Complex Order
and Applied Analysis 3 Definition 1.1 Hadamard product or convolution . For functions f and g in the class A, where f z of the form 1.1 and g z is given by g z z ∞ ∑ k 2 ckz , 1.8 the Hadamard product or convolution f ∗ g z is defined by ( f ∗ g z z ∞ ∑ k 2 akbkz k ( g ∗ f z , z ∈ U. 1.9 Definition 1.2 subordination principle . For analytic functions g and hwith g 0 h 0 , g is said to be subord...
متن کاملRegular Graphs with Maximum Forest Number
Let G be a graph and F ⊆ V (G). Then F is called an induced forest of G if 〈G〉 contains no cycle. The forest number, f(G), of G is defined by f(G) := max{|F | : F is an induced forest of G}. It was proved by the second author in [6] that if G is an r-regular graph of order n, then f(G) ≤ b nr−2 2(r−1)c. It was also proved that the bound is sharp by constructing an r-regular graph H of order n w...
متن کاملThe Use of Phase Lag and Amplification Error Derivatives for the Construction of a Modified Runge-Kutta-Nyström Method
and Applied Analysis 3 Lemma 6. For the construction of a method with nullification of phase lag, amplification error, and their derivatives, onemust satisfy the conditions R(z) = 2 cos(z), Q(z) = 1, R(z) = −2 sin(z), Q(z) = 0. 4. Derivation of the New Modified RKN Method The new method that we are going to develop in this section, is a four-stage explicit Runge-Kutta-Nyström method with the FS...
متن کاملThe convolution inverse of an arithmetic function
Good, but does an inverse g of f have to exist? A necessary condition is that f(1) 6= 0. Indeed, if g is the inverse of f , then 1 = I(1) = (f ∗ g)(1) = f(1)g(1). We now show that this necessary condition is also sufficient. We assume that f(1) 6= 0 and we try and solve for g. What this means is that we are solving for infinitely many unknowns: g(1), g(2), . . . . From the above, we see that th...
متن کاملBi-harmonic Functions on Groups
| Two natural deenitions of bi-harmonic functions on countable groups are shown to essentially coincide. Criteria of absence of non-constant bounded bi-harmonic functions are formulated. A description of these functions for free groups is given. Fonctions bi-harmoniques sur les groupes R esum e R esum e | Nous montrons l' equivalence essentielle de deux d eenitions naturelles des fonctions bi-h...
متن کاملOne Pile Nim with Arbitrary Move Function
This paper solves a class of combinatorial games consisting of one-pile counter pickup games for which the maximum number of counters that can be removed on each successive move equals f(t), where t is the previous move size and f is an arbitrary function. The purpose of this paper is to solve a class of combinatorial games consisting of one-pile counter pickup games for which the maximum numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996